Rainbow Domination in Generalized de Bruijn Digraphs
نویسندگان
چکیده
In this paper, we are concerned with the krainbow domination problem on generalized de Bruijn digraphs. We give an upper bound and a lower bound for the k-rainbow domination number in generalized de Bruijn digraphs GB(n, d). We also show that γrk(GB(n, d)) = k if and only if α 6 1, where n = d+α and γrk(GB(n, d)) is the k-rainbow domination number of GB(n, d).
منابع مشابه
On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs
This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graphs. We construct dominating sets of generalized de Bruijn digraphs where obtained dominating sets ...
متن کاملReinforcement numbers of digraphs
The reinforcement number of a graph G is the minimum cardinality of a set of extra edges whose addition results in a graph with domination number less than the domination number of G. In this paper we consider this parameter for digraphs, investigate the relationship between reinforcement numbers of undirected graphs and digraphs, and obtain further results for regular graphs. We also determine...
متن کاملSolution to Some Open Problems on Absorbant of Generalized de Bruijn Digraphs
The generalized de Bruijn digraph GB(n,d) has good properties as an interconnection network topology. The resource location problem in an interconnection network is one of the facility location problems. Finding absorbants of a digraph corresponds to solving a kind of resource location problem. In this paper, we solve some open problems given in the article ”Erfang Shan, T.C.E.Cheng, Liying Kan...
متن کاملOn the power domination number of de Bruijn and Kautz digraphs
Let G = (V,A) be a directed graph without parallel arcs, and let S ⊆ V be a set of vertices. Let the sequence S = S0 ⊆ S1 ⊆ S2 ⊆ · · · be defined as follows: S1 is obtained from S0 by adding all out-neighbors of vertices in S0. For k > 2, Sk is obtained from Sk−1 by adding all vertices w such that for some vertex v ∈ Sk−1, w is the unique out-neighbor of v in V \ Sk−1. We set M(S) = S0 ∪S1 ∪ · ...
متن کاملHamiltonicity of large generalized de Bruijn cycles
In this article, we determine when the large generalized de Bruijn cycles BGC(p, d, n) are Hamiltonian. These digraphs have been introduced by Gómez, Padró and Pérennes as large interconnection networks with small diameter and they are a family of generalized p-cycles. They are the Kronecker product of the generalized de Bruijn digraph GB(d, n) and the dicycle of length p, where GB(d, n) is the...
متن کامل